Inconsistency can be Necessary for Learning in Polynomial Time
نویسندگان
چکیده
In designing learning algorithms it seems quite reasonable to construct them in a way such that all data the algorithm already has obtained are correctly and completely reflected in the hypothesis the algorithm outputs on these data. However, this approach may totally fail, i.e., it may lead to the unsolvability of the learning problem, or it may exclude any efficient solution of it. In particular, we present a natural learning problem and prove that it can be solved in polynomial time if and only if the algorithm is allowed to ignore data.
منابع مشابه
TBM Tunneling Construction Time with Respect to Learning Phase Period and Normal Phase Period
In every tunnel boring machine (TBM) tunneling project, there is an initial low production phase so-called the Learning Phase Period (LPP), in which low utilization is experienced and the operational parameters are adjusted to match the working conditions. LPP can be crucial in scheduling and evaluating the final project time and cost, especially for short tunnels for which it may constitute a ...
متن کاملبررسی و تبیین مشکل ناسازگاری زمانی
In very, simple words, time inconsistency means failing to conduct programs in consistence with time. In other words, time inconsistency refers to a situation where economic decision-makers preferences transform a long time in a way that what they preferred at a certain time point is not consistent with their preferences at other time points. In everyday life, we always face time inconsistency....
متن کاملA Stylistic and Proficiency-based Approach to EFL Learners’ Performance Inconsistency
Performance deficiencies and inconsistencies among SLA or FL learners can be attributed to variety of sources including both systemic (i.e., language issues) and individual variables. Contrary to a rich background, the literature still suffers from a gap as far as delving into the issue from language proficiency and learning style is concerned. To fill the gap, this study addressed EFL learner...
متن کاملTenacity and some other Parameters of Interval Graphs can be computed in polynomial time
In general, computation of graph vulnerability parameters is NP-complete. In past, some algorithms were introduced to prove that computation of toughness, scattering number, integrity and weighted integrity parameters of interval graphs are polynomial. In this paper, two different vulnerability parameters of graphs, tenacity and rupture degree are defined. In general, computing the tenacity o...
متن کاملPolicy Time-Inconsistency: A Comparison of Managed Floating Exchange Rate and Controlled Exchange Rate Regimes
Some empirical and theoretical studies have emphasized on fixed exchange rate regime in controlling time inconsistency, while others consider the role of target zone regime as an important factor. Thus there is no general consensus to decide which exchange rate regime may bring about less time-inconsistency. The main purpose of this study is to investigate policy time-inconsistency in exchange ...
متن کامل